A Weakly Homomorphic Encryption with LDN

As an effective solution to protect the privacy of the data, homomorphic encryption has become a hot research topic. Existing homomorphic schemes are not truly practical due to their huge key size. In this paper, we present a simple weakly homomorphic encryption scheme using only elementary modular arithmetic over the integers rather than working with ideal lattices. Compared with DGHV’s construction, the proposed scheme has shorter public key and ciphertext size. The main appeal of our approach is the conceptual simplicity. We reduce the security of weakly homomorphic scheme to “learning divisor with noise (LDN)”.